Curves in P and Bezout’s Theorem
نویسنده
چکیده
In this paper we introduce projective geometry and one of its important theorems. We begin by defining projective space in terms of homogenous coordinates. Next, we define homgenous curves, and describe a few important properties they have. We then introduce Bezout’s Theorem, which asserts that the number of intersection points of two homogenous curves is less than or equal to the product of their degrees. We conclude by proving the theorem, assuming several results about intersection multiplicities.
منابع مشابه
On the Intersection of Acm Curves in P
Bezout’s theorem gives us the degree of intersection of two properly intersecting projective varieties. As two curves in P never intersect properly, Bezout’s theorem cannot be directly used to bound the number of intersection points of such curves. In this work, we bound the maximum number of intersection points of two integral ACM curves in P. The bound that we give is in many cases optimal as...
متن کاملBezout’s theorem: I
This week we will be studying the tropical analogue of Bezout’s theorem, which in classical geometry gives a precise count of the number of intersections between two projective algebraic curves. It turns out, interestingly, that although all the definitions (except that of intersection) are different in tropical geometry, we can also prove a theorem with the same statement. Next time, we will s...
متن کاملBezout Curves in the Plane
First, recall how Bezout’s Theorem can be made more precise by specifying the meaning of the word “generically” used above, using elementary scheme-theoretic language ([H, II]). Fix an algebraically closed field k. There is little loss in assuming k = C (until Section 3). Since we work over an algebraically closed field, we often identify reduced algebraic sets with their k-valued points. In th...
متن کاملStrassen’s lower bound for polynomial evaluation and Bezout’s theorem
Strassen’s lower bound for polynomial evaluation and Bezout’s theorem Recall Strassen’s algorithm from the previous lecture: Given: (a0, . . . , an−1), (x1, . . . , xn) ∈ K, and polynomial p(x) = ∑n−1 i=0 aix i Task: find (z1, . . . , zn), zi = p(xi) How many steps do we need to accomplish this task? Using the Fast Fourier Transform (FFT) we need O(n log n) steps. Strassen was interested whethe...
متن کاملSharp extension theorems and Falconer distance problems for algebraic curves in two dimensional vector spaces over finite fields
In this paper we study extension theorems associated with general varieties in two dimensional vector spaces over finite fields. Applying Bezout’s theorem, we obtain the sufficient and necessary conditions on general curves where sharp L − L extension estimates hold. Our main result can be considered as a nice generalization of works by Mochenhaupt and Tao in [16] and Iosevich and Koh in [9]. A...
متن کامل